Requirement for quantum computation

Requirement for quantum computation

We identify “proper quantum computation” with computational processes that cannot be efficiently simulated on a classical computer. For optical quantum computation, we establish “no-go” theorems for classes of quantum optical experiments that cannot yield proper quantum computation, and we identify requirements for optical proper quantum computation that correspond to violations of assumptions ...

Quantum cellular automaton for universal quantum computation

A number of physical systems that are considered for the realization of a universal quantum computer, such as optical lattices 1 or arrays of microlenses 2 , possess a translation symmetry in the arrangement of qubits and their mutual interaction. Quantum cellular automata QCA represent a suitable framework to explore the computational power of such physical systems, because they respect this s...

Quantum Dot Quantum Computation

Within the last few years, quantum computation has developed into a truly interdisciplinary field involving the contributions of physicists, engineers, and computer scientists. There have been several experimental studies in order to find the proper physical realization of qubits to perform quantum computation. One of the most promising candidates for qubits is the spin state of the electrons, ...

Semantic Techniques for Quantum Computation

Alternative Models for Quantum Computation

We propose and study two new computational models for quantum computation, and infer new insights about the circumstances that give quantum computers an advantage over classical ones. The bomb query complexity model is a variation on the query complexity model, inspired by the Elitzur-Vaidman bomb tester. In this model after each query to the black box the result is measured, and the algorithm ...